Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("LEUNG, J. Y")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 33

  • Page / 2
Export

Selection :

  • and

Glucose transporters and FDG uptake in untreated primary human non-small cell lung cancerBROWN, R. S; LEUNG, J. Y; KISON, P. V et al.The Journal of nuclear medicine (1978). 1999, Vol 40, Num 4, pp 556-565, issn 0161-5505Article

Intratumoral distribution of tritiated fluorodeoxyglucose in breast carcinoma. I: Are inflammatory cells important ?BROWN, R. S; LEUNG, J. Y; FISHER, S. J et al.The Journal of nuclear medicine (1978). 1995, Vol 36, Num 10, pp 1854-1861, issn 0161-5505Article

A role for Myc in facilitating transcription activation by E2F1LEUNG, J. Y; EHMANN, G. L; GIANGRANDE, P. H et al.Oncogene (Basingstoke). 2008, Vol 27, Num 30, pp 4172-4179, issn 0950-9232, 8 p.Article

Intratumoral distribution of tritiated-FDG in breast carcinoma : Correlation between Glut-1 expression and FDG uptakeBROWN, R. S; LEUNG, J. Y; FISHER, S. J et al.The Journal of nuclear medicine (1978). 1996, Vol 37, Num 6, pp 1042-1047, issn 0161-5505Article

Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphsLEUNG, J. Y.-T.Journal of algorithms (Print). 1984, Vol 5, Num 1, pp 22-35, issn 0196-6774Article

Minimizing the number of late jobs on unrelated machinesJIANZHONG DU; LEUNG, J. Y.-T.Operations research letters. 1991, Vol 10, Num 3, pp 153-158, issn 0167-6377Article

Scheduling tree-structured tasks on two processors to minimize schedule lengthJIANZHONG DU; LEUNG, J. Y. T.SIAM journal on discrete mathematics. 1989, Vol 2, Num 2, pp 176-196Article

Minimizing mean flow time with release time and deadline constraintsJIANZHONG DU; LEUNG, J. Y.-T.Journal of algorithms (Print). 1993, Vol 14, Num 1, pp 45-68, issn 0196-6774Article

Minimizing mean flow time in two-machine open shops and flow shopsJIANZHONG DU; LEUNG, J. Y.-T.Journal of algorithms (Print). 1993, Vol 14, Num 1, pp 24-44, issn 0196-6774Article

Minimizing total tardiness on one machine is NP-hardJIANZHONG DU; LEUNG, J. Y.-T.Mathematics of operations research. 1990, Vol 15, Num 3, pp 483-495, issn 0364-765XArticle

Scheduling tree-structured tasks with restricted execution timesJIANZHONG DU; LEUNG, J. Y.-T.Information processing letters. 1988, Vol 28, Num 4, pp 183-188, issn 0020-0190Article

Tighter bounds on a heuristic for a partition problemLEUNG, J. Y.-T; WEI, W.-D.Information processing letters. 1995, Vol 56, Num 1, pp 51-57, issn 0020-0190Article

On multidimensional packet routing for meshes with busesLEUNG, J. Y.-T; SHENDE, S. M.Journal of parallel and distributed computing (Print). 1994, Vol 20, Num 2, pp 187-197, issn 0743-7315Article

Preemptive scheduling of equal length jobs on two machines to minimize mean flow timeHERRBACH, L. A; LEUNG, J. Y.-T.Operations research. 1990, Vol 38, Num 3, pp 487-494, issn 0030-364X, 8 p.Article

Minimizing schedule length subject to minimum flow timeLEUNG, J. Y.-T; YOUNG, G. H.SIAM journal on computing (Print). 1989, Vol 18, Num 2, pp 314-326, issn 0097-5397Article

On the 2-dimensional channel assignment problemLEE, D. T; LEUNG, J. Y.-T.IEEE transactions on computers. 1984, Vol 33, Num 1, pp 2-6, issn 0018-9340Article

Complexity of two dual criteria scheduling problemsYUMEI HUO; LEUNG, J. Y.-T; HAIRONG ZHAO et al.Operations research letters. 2007, Vol 35, Num 2, pp 211-220, issn 0167-6377, 10 p.Article

Probabilistic analysis of a bin covering algorithmHAN, S; HONG, D; LEUNG, J. Y.-T et al.Operations research letters. 1996, Vol 18, Num 4, pp 193-199, issn 0167-6377Article

On-line scheduling of real-time tasksHONG, K. S; LEUNG, J. Y.-T.IEEE transactions on computers. 1992, Vol 41, Num 10, pp 1326-1331, issn 0018-9340Article

Probabilistic analysis of k-dimensional packing algorithmsDAWEI HONG; LEUNG, J. Y.-T.Information processing letters. 1995, Vol 55, Num 1, pp 17-24, issn 0020-0190Article

Preemptive scheduling to minimize mean weighted flow timeLEUNG, J. Y.-T; YOUNG, G. H.Information processing letters. 1990, Vol 34, Num 1, pp 47-50, issn 0020-0190Article

Minimizing mean flow time with release time constraintDU, J; LEUNG, J. Y.-T; YOUNG, G. H et al.Theoretical computer science. 1990, Vol 75, Num 3, pp 347-355, issn 0304-3975, 9 p.Article

tardive dystonia in ChineseCHIU, H. F. K; LEUNG, J. Y. W; LEE, S et al.Singapore medical journal. 1989, Vol 30, Num 5, pp 441-443, issn 0037-5675Article

On some variants of the bandwidth minimization problemLEUNG, J. Y.-T; VORNBERGER, O; WITTHOFF, J. D et al.SIAM journal on computing (Print). 1984, Vol 13, Num 3, pp 650-667, issn 0097-5397Article

On-line routing of real-time messagesLEUNG, J. Y.-T; TAM, T. W; YOUNG, G. H et al.Journal of parallel and distributed computing (Print). 1996, Vol 34, Num 2, pp 211-217, issn 0743-7315Article

  • Page / 2